Combination in mod P

$ _nC_k = C(n, k) = \binom{n}{k} = \frac{n!}{k!(n-k)!}

for large numbers n and k.

Assume that the value in mod P is good.

After taking the remainder, no ordinary division can be performed.

For single-shot calculations, create an inverse original in logarithmic order.

---